Accurate solution of dense linear systems, Part II: Algorithms using directed rounding

نویسنده

  • Siegfried M. Rump
چکیده

In Part I and this Part II of our paper we investigate how extra-precise evaluation of dot products can be used to solve ill-conditioned linear systems rigorously and accurately. In Part I only rounding to nearest is used. In this Part II we improve the results significantly by permitting directed rounding. Linear systems with tolerances in the data are treated, and a comfortable way is described to compute error bounds for extremely illconditioned linear systems with condition numbers up to about u−2/n, where u denotes the relative rounding error unit in a given working precision. We improve a method by Hansen/Bliek/Rohn/Ning/Kearfott/Neumaier. Of the known methods by Krawczyk, Rump, Hansen et al., Ogita and Nguyen we show that our presented Algorithm LssErrBnd seems the best compromise between accuracy and speed. Moreover, for input data with tolerances, a new method to compute componentwise inner bounds is presented. For not too wide input data they demonstrate that the computed inclusions are often almost optimal. All algorithms are given in executable Matlab code and are available from my homepage. © 2012 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accurate solution of dense linear systems, part I: Algorithms in rounding to nearest

We investigate how extra-precise accumulation of dot products can be used to solve illconditioned linear systems accurately. For a given p-bit working precision, extra-precise evaluation of a dot product means that the products and summation are executed in 2pbit precision, and that the final result is rounded into the p-bit working precision. Denote by u = 2−p the relative rounding error unit ...

متن کامل

Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut

We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) the input is an edge-weighted directed graph G = (V,E) and a set of k terminal nodes {s1, s2, . . . , sk} ⊆ V ; the goal is to find a min-weight subset of edges whose removal ensures that there is no path from si to sj ...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

Algorithms for alpha-rate domination problems on weighted graphs

In this article, we investigate a domination set problem variant on vertex-weighted graphs. In the last few years, several algorithms have been presented for solving the minimum alpha and alpha-rate domination problem (also known as the positive influence dominating sets problem) on simple graphs. We recently proposed an algorithm for alpha-rate domination on weighted graphs based on randomised...

متن کامل

Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest

In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the rounded-to-nearest result of s := ∑ pi for a given vector of floatingpoint numbers pi, as well as algorithms for directed rounding. A special algorithm for computing the sign of s is given, also working for huge dimensions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Computational Applied Mathematics

دوره 242  شماره 

صفحات  -

تاریخ انتشار 2013